Finding Equilibria in the Traffic Assignment Problem with Primal-Dual Gradient Methods for Stable Dynamics Model and Beckmann Model

In this paper, we consider the application of several gradient methods to traffic assignment problem: search equilibria in stable dynamics model (Nesterov and De Palma, 2003) Beckmann model. Unlike celebrated Frank–Wolfe algorithm widely used for model, these gradients solve dual problem then reconstruct a solution primal one. We deal with universal method, method similar triangles, weighted averages estimate their complexity problem. Due primal-dual nature methods, use duality gap stopping criterion. particular, present novel way admissible flows which provides us computable gap.